Strongly Typed Rewriting For Coupled Software Transformation
نویسندگان
چکیده
منابع مشابه
Strongly Typed Rewriting For Coupled Software Transformation
Coupled transformations occur in software evolution when multiple artifacts must be modified in such a way that they remain consistent with each other. An important example involves the coupled transformation of a data type, its instances, and the programs that consume or produce it. Previously, we have provided a formal treatment of transformation of the first two: data types and instances. Th...
متن کاملTransformation by Templates for Simply-Typed Term Rewriting
Huet and Lang [4] introduced a framework of program transformation by templates. In this framework, the second-order matching algorithm plays an important role—how to apply the transformation template to a given program is specified by the solution of the matching algorithm. Curien et al. [3] gave an efficient matching algorithm. Yokoyama et al. [7] presented a sufficient condition of patterns ...
متن کاملStrongly typed, compile-time safe and loosely coupled data persistence
A large number of approaches have been developed to simplify construction of, and to reduce errors in, data-driven applications. However, these approaches have not been particularly concerned with compile-time type safety. Type mismatch errors between program and the database schema occur quite often during program development, and the techniques used in these approaches often defer error check...
متن کاملStrongly Typed Genetic Programming
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on par...
متن کاملStrongly typed evolutionary programming
As the potential of applying machine learning techniques to perplexing problems is realised, increasingly complex problems are being tackled, requiring intricate explanations to be induced. Escher is a functional logic language whose higher-order constructs allow arbitrarily complex observations to be captured and highly expressive generalisations to be conveyed. The work presented in this thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.10.019